A Job-Shop Scheduling Task for Evaluating Coordination during Computer Supported Collaboration

نویسندگان

  • Desney S. Tan
  • Darren Gergle
  • Mary Czerwinski
چکیده

Researchers have begun to explore tools that allow multiple users to collaborate across multiple devices. One class of these tools allows users to simultaneously place and interact with information on shared displays. Unfortunately, there is a lack of good tasks to evaluate the effectiveness of these tools for information coordination in such scenarios. In this paper, we present collaborative jobshop scheduling, a task we have designed to evaluate systems and interactions within computer supported collaboration environments. We describe properties that make the task useful, as well as evaluation measures that can be used with this task. We validate the feasibility of the task and demonstrate analysis techniques in an experiment we conducted to compare the differences between presenting information serially versus simultaneously on a large shared display. Results from this experiment show the benefits of shared visual information when performing coordination tasks.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Optimality of the flexible job shop scheduling system based on Gravitational Search Algorithm

The Flexible Job Shop Scheduling Problem (FJSP) is one of the most general and difficult of all traditional scheduling problems. The Flexible Job Shop Problem (FJSP) is an extension of the classical job shop scheduling problem which allows an operation to be processed by any machine from a given set. The problem is to assign each operation to a machine and to order the operations on the machine...

متن کامل

Optimality of the flexible job shop scheduling system based on Gravitational Search Algorithm

The Flexible Job Shop Scheduling Problem (FJSP) is one of the most general and difficult of all traditional scheduling problems. The Flexible Job Shop Problem (FJSP) is an extension of the classical job shop scheduling problem which allows an operation to be processed by any machine from a given set. The problem is to assign each operation to a machine and to order the operations on the machine...

متن کامل

A Job Shop Scheduling Problem with Sequence-Dependent Setup Times Considering Position-Based Learning Effects and Availability Constraints

 Sequence dependent set-up times scheduling problems (SDSTs), availability constraint and transportation times are interesting and important issues in production management, which are often addressed separately. In this paper, the SDSTs job shop scheduling problem with position-based learning effects, job-dependent transportation times and multiple preventive maintenance activities is studied. ...

متن کامل

Economically Coordinated Job Shop Scheduling and Decision Point Bidding - An Example for Economic Coordination in Manufacturing and Logistics

We discuss the application of economic coordination mechanisms to scheduling problems in manufacturing and logistics. We use job shop scheduling as a sample problem domain. We study economically augmented job shop problems (EJSP) which comprise valuation information. We demonstrate how instances of EJSP can be mapped to combinatorial job shop auction problems (CJSAP). A discussion of the tracta...

متن کامل

An algorithm for multi-objective job shop scheduling problem

Scheduling for job shop is very important in both fields of production management and combinatorial op-timization. However, it is quite difficult to achieve an optimal solution to this problem with traditional opti-mization approaches owing to the high computational complexity. The combination of several optimization criteria induces additional complexity and new problems. In this paper, we pro...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005